Initial QP Determination Algorithm using Bit Rate Model
نویسندگان
چکیده
منابع مشابه
PSNR-based Initial QP Determination for Low Bit Rate Video Coding
In H.264/AVC, the first frame of a group of pictures (GOP) is encoded in intra mode which generates a large number of bits. The number of bits for the I-frame affects the qualities of the following frames of a GOP since they are encoded using the bits remaining among the bits allocated to the GOP. In addition, the first frame is used for the inter mode encoding of the following frames. Thus, th...
متن کاملDetermination of constant coefficients of Bourgoyne and Young drilling rate model using a novel evolutionary algorithm
Achieving minimum cost and time in reservoir drilling requires evaluating the effects of the drilling parameters on the penetration rate and constructing a drilling rate estimator model. Several drilling rate models have been presented using the drilling parameters. Among these, the Bourgoyne and Young (BY) model is widely utilized in order to estimate the penetration rate. This model relates s...
متن کاملAvailable Bit Rate Teletraffic Control Using Model Predictive Control
Model Predictive Control is analyzed as a strategy for coping with the unknown, variable and non-deterministic action and measurement delays which can occur in congestion control of available-bit-rate teletraffic control for highspeed data networks. It is shown that the state-feedbackplus-estimator certainty equivalence nature of this control law is particularly amenable to coping with these de...
متن کاملالگوریتم کنترل نرخ بیت متغیر ویدئو در سطح گروه تصاویر برای استاندارد فشردهسازی H.265
A rate control algorithm at the group of picture (GOP) level is proposed in this paper for variable bit rate applications of the H.265/HEVC video coding standard with buffer constraint. Due to structural changes in the HEVC compared to the previous standards, new rate control algorithms are needed to be designed. In the proposed algorithm, quantization parameter (QP) of each GOP is obtained by ...
متن کاملQP tries are smaller and faster than crit-bit trees
A trie data structure stores an ordered set of keys; the branching structure of a trie depends on the lexical properties of its keys independent of the order of insertion. Compact implementations of PATRICIA binary tries called crit-bit trees [2] have just two words of overhead per item stored. A hash array mapped trie (HAMT) [1] has wide fan-out, indexing each tree node using several hashed ke...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of the Korean Institute of Information and Communication Engineering
سال: 2012
ISSN: 2234-4772
DOI: 10.6109/jkiice.2012.16.9.1947